Dynamic Programming Approach to Optimization of Site Remediation
نویسنده
چکیده
Environmental restoration is a matter of national concern. Decades of abuse by industry, agriculture, and the military have caused devastating contamination of the earth, air, and water. The Department of Energy alone will spend hundreds of billions of dollars on containment and restoration. It is imperative that restoration costs are minimized. Every dollar spent on restoration is a dollar that will not go toward research, a dollar that will not go to upgrade our nation’s infrastructure. The work presented here uses cost as a decision variable in restoration projects. Contaminated sites frequently vary from one point to another in type and level of contamination. In addition, a single piece of property may contain several distinct contaminated areas, each of which has characteristics unlike any of the other areas. Thus one should look at optimizing the selection of remediation technologies to address the variation. A methodology has been developed that will optimize the selection of remediation technologies based on cost. This methodology uses geostatistics and dynamic programming to break a site into discrete cells and then select the optimal sequence of remediation technologies. DOI: 10.1061/ ASCE 0733-9364 2008 134:10 820 CE Database subject headings: Computer programming; Construction management; Cost estimates; Optimization; Environmental issues; Restoration.
منابع مشابه
Open pit limit optimization using dijkstra’s algorithm
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملMathematical Programming Approach To Allocate Local Or National Resources For Bridge Maintenance Rehabilitation & Replacement Planning (RESEARCH NOTE)
Today’s, the transportation facilities such as terminals, street, bridge, etc, represent the major investment in highway network. Every year tremendous resources should be invested to maintain these facilities. Among them, the Bridge Management System (B.M.S.) has been necessitated by large imbalance between extensive bridge repair and maintenance needs and limited available budget. So the main...
متن کاملRobust Optimization Approach for Design for a Dynamic Cell Formation Considering Labor Utilization: Bi-objective Mathematical Model
In this paper, robust optimization of a bi-objective mathematical model in a dynamic cell formation problem considering labor utilization with uncertain data is carried out. The robust approach is used to reduce the effects of fluctuations of the uncertain parameters with regards to all the possible future scenarios. In this research, cost parameters of the cell formation and demand fluctuation...
متن کامل